#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;

int main(int argc, char const *argv[]){
    int buf_data[100];
    int n;
    while(scanf("%d", &n) != EOF){
        for (int i = 0; i < n; i++)
            scanf("%d", &buf_data[i]);
        sort(buf_data, buf_data+n);
        int search_times;
        scanf("%d", &search_times);
        for (int i = 0; i < search_times; i++){
            bool result = false;
            int search_num;
            scanf("%d", &search_num);
            int min = 0, max = n-1;
            while(max >= min){
                int mid = (max + min) / 2;
                if(buf_data[mid] > search_num)
                    max = mid - 1;
                else if(buf_data[mid] < search_num)
                    min = mid + 1;
                else{
                    result = true;
                    break;
                }
            }
            if (result == true)
                printf("Yes\n");
            else
                printf("No\n");
        }
    }
    return 0;
}
